import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;


class Data {

    private int x;
    private int y;
    public Data(){

    }
    public Data(int x, int y) {
        this.x = x;
        this.y = y;
    }

   public int getX() {
        return this.x;
    }

    public int getY() {
        return this.y;
    }

}
public class Test {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            Data data = new Data(x, y);
            System.out.println(data.getX() + data.getY());
        }
    }





    public static void main4(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Random random = new Random();
        int a = random.nextInt(20);
        System.out.println(a);
        while (true){
            int sc = scanner.nextInt();

            if(sc < a){
                System.out.println("猜小了！");
            }
            else if(sc > a){
                System.out.println("猜大了！");
            }else {
                System.out.println("猜对了！");
                break;
            }

        }
    }






    public static int[] bubb(int [] arr){
        for (int i = 0; i < arr.length - 1; i++) {
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if(arr[j] > arr[j+1]){
                    int tmp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = tmp;
                }
            }
        }
        return arr;
    }


    public static void main3(String[] args) {
        //冒泡排序
        int [] arr = {1,5,7,9,8,6,3,4};
        bubb(arr);
        System.out.println(Arrays.toString(bubb(arr)));
    }
    public static int BinarySearch(int [] a,int key){
        int left = 0;
        int right = a.length-1;
        while(left <= right){
            int m = (left + right) / 2;
            if(a[m] < key){
                left = m + 1;
            }
            else if(a[m] > key){
                right = m - 1;
            }else{
                return m;
            }
        }
        return -1;
    }


    //二分查找
    public static void main2(String[] args) {
        int [] a = {1,5,7,1,6,5,8,6,45};
        int key = 5;
        Arrays.sort(a);
        int ret = BinarySearch(a,45);
        System.out.println(ret);

    }









    public static int[] func(int[] array) {
        int left = 0;
        int right = array.length - 1;
        while (left < right) {
            if (left < right && array[left] % 2 != 0) {
                left++;
            }
            if (left < right && array[right] % 2 == 0) {
                right--;
            }
            if (left < right) {
                int tmp = array[left];
                array[left] = array[right];
                array[right] = tmp;
            }
        }

        return array;

    }

    public static void main1(String[] args) {
        int [] array = {1,2,3,4,5,6};
        func(array);
        System.out.println(Arrays.toString(func(array)));

    }
}
//        调整数组顺序使得奇数位于偶数之前。调整之后，不关心大小顺序。
//
//        如数组：[1,2,3,4,5,6]
//
//        调整后可能是：[1, 5, 3, 4, 2, 6]





